A tableau construction for finite linear-time temporal logic

This paper gives a tableau-based technique for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of given formula. Finite LTL differs from traditional that interpreted with respect to finite, rather than infinite, sequences states; this fact means automata, ω -automata such as those developed by Büchi and others, suffice recognizing formulas. The approach presented here works associating each state constructed automaton formula satisfied can be accepted when started state. Such tableau-construction techniques well-known setting LTL, where they used construct -automata; we adapt automata. resulting may basis model checking, synthesis, query checking satisfiability testing.